In Cache ? Object Expiry Time Reached ? Object Refresh Interval Time Reached ? from Cache
نویسندگان
چکیده
The continued increase in demand for information services on the Internet is showing signs of strain. While the Internet is a highly distributed system, individual data objects most often have only a single source. Host computers and network links can easily become overloaded when a large number of users access very popular data. Proxy-caching is currently a popular way to reduce network bandwidth, server load and to improve response time to the user. The original caching proxy, from CERN, is probably still the most widely used. This paper describes software developed by the author that investigates some alternative techniques for caching WorldWide Web objects. This software complements traditional proxy-caching by allowing servers to explicitly grant or deny permission to cache an object, and with support for server-initiated callback in-validation of changed objects.
منابع مشابه
Perfectly Dynamic Average of Inter-reference Time as a Metric of Web Cache Replacement Policy
Caching objects in Internet environment is aimed to reduce bandwidth consumption and increase the response time of system in term of user perception. In limited size of web cache, it needs to manage the objects in web cache so that the hit ratio and byte hit ratio are optimal. For solving this problem, researcher propose many web cache replacement policies such as LRU, LFU, GDS, GDSF, GD*, and ...
متن کاملRegularly Expected Reference-time as a Metric of Web Cache Replacement Policy
The growth of Internet access was increasing significantly. In facts, more than one user access the same object so there is an opportunity to reduce this redundancy by placing an intermediate storage called cache. By this approach, the bandwidth consumption and response time of system in term of user perception can be improved. When the size of web cache is limited, it needs to manage the objec...
متن کاملA Cache Management Scheme for Object-based Storage
This paper presents a cache management scheme for object-based storage, which consists of three main aspects. First, the cache update policy is proposed. The strategy considers the overall cache as a pool, consistency and accuracy of updating is ensured through the locking mechanism, while using Bloom Filter combined with the updated time series to achieve updating simplification. Secondly, the...
متن کاملCache Line Boundary Allocation for Garbage Collected Systems
WAGLE, PRASAD AJIT. Cache Line Boundary Allocation for Garbage Collected Systems. (Under the direction of Dr. Edward F Gehringer.) Garbage-collected systems became increasingly popular with the release of the Java programming language. Cache performance of garbage-collected systems has been a heavily researched area. Past work has shown that cache-line utilization has been poor in garbagecollec...
متن کاملCollaborative Object Caching for Heterogeneous OSD Clusters
With the emerging of 10 Gbps Ethernet, modern storage networks allow the hosts to access remote cache nearly as quickly as they can access from their local storages. Aiming at improving the performance and load-balancing of large-scaled object-based storage systems, we propose an objectbased caching scheme that works collaboratively by distributing redundant objects among neighboring object-bas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995